منابع مشابه
Fractional L-intersecting families
Let L = {1 b1 , . . . , as bs }, where for every i ∈ [s], ai bi ∈ [0, 1) is an irreducible fraction. Let F = {A1, . . . , Am} be a family of subsets of [n]. We say F is a fractional L-intersecting family if for every distinct i, j ∈ [m], there exists an ab ∈ L such that |Ai ∩Aj | ∈ {ab |Ai|, ab |Aj |}. In this paper, we introduce and study the notion of fractional L-intersecting families.
متن کاملIntersecting families of sets, no l containing two common elements
Let H denote the set {f1, f2, ..., fn}, 2 the collection of all subsets of H and F ⊆ 2 be a family. The maximum of |F| is studied if any k subsets have a non-empty intersection and the intersection of any l distinct subsets (1 ≤ k < l) is empty. This problem is reduced to a covering problem. If we have the conditions that any two subsets have a non-empty intersection and the intersection of any...
متن کاملChain Intersecting Families
Let F be a family of subsets of an n-element set. F is called (p,q)-chain intersecting if it does not contain chains A1 ( A2 ( · · · ( Ap and B1 ( B2 ( · · · ( Bq with Ap∩Bq = ∅. The maximum size of these families is determined in this paper. Similarly to the p = q = 1 special case (intersecting families) this depends on the notion of r-complementing-chain-pair-free families, where r = p + q − ...
متن کاملRegular Intersecting Families
We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families F of k-element subsets of [n] := {1, . . . , n}, such that every element of [n] lies in the same (or approximately the same) number of members of F . In particular, we show that we can guarantee |F| = o( ( n−1 k−1 ) ) if and only if k = o(n).
متن کاملG-Intersecting Families
Let G be a graph on vertex set [n], and for X [n] let N(X) be the union of X and it's neighborhood in G. A family of sets F 2 is G-intersecting if N(X) \ Y 6= ; for all X;Y 2 F . In this paper we study the cardinality and structure of the largest k-uniform G-intersecting families on a xed graph G.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/7846